Repeated Games with Bounded Entropy

نویسندگان

  • Abraham Neyman
  • Daijiro Okada
چکیده

We investigate the asymptotic behavior of the maxmin values of repeated two-person zero-sum games with a bound on the strategic entropy of the maximizer’s strategies while the other player is unrestricted. We will show that if the Ž . bound h n , a function of the number of repetitions n, satisfies the condition Ž . Ž . nŽ Ž .. Ž .Ž . h n rn a g n a ` , then the maxmin value W h n converges to cav U g , the concavification of the maxmin value of the stage game in which the maximizer’s actions are restricted to those with entropy at most g . A similar result is obtained for the infinitely repeated games. Journal of Economic Literature Classification Numbers: C73, C72. Q 2000 Academic Press

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Growth of strategy sets, entropy, and nonstationary bounded recall

The paper initiates the study of long term interactions where players’ bounded rationality varies over time. Time dependent bounded rationality is reflected in part in the number ψ(t) of distinct strategies in the first t-stages. We examine how the growth rate of ψi(t) affects equilibrium outcomes of repeated games. An upper bound on the individually rational payoff is derived for a class of tw...

متن کامل

On finite strategy sets for finitely repeated zero-sum games

We study finitely repeated two-person zero-sum games in which Player 1 is restricted to mixing over a fixed number of pure strategies while Player 2 is unrestricted. We describe an optimal set of pure strategies for Player 1 along with an optimal mixed strategy. We show that the entropy of this mixed strategy appears as a factor in an exact formula for the value of the game and thus is seen to ...

متن کامل

Repeated Games with Public Signal and Bounded Recall

This paper studies repeated games with public signals, symmetric bounded recall and pure strategies. Examples of equilibria for such games are provided and the convergence of the set of equilibrium payoffs is studied as the size of the recall increases. Convergence to the set of equilibria of the infinitely repeated game does not hold in general but for particular signals and games. The differe...

متن کامل

[This Version: September 27, 2005] GROWTH OF STRATEGY SETS, ENTROPY, AND NONSTATIONARY BOUNDED RECALL

One way to express bounded rationality of a player in a game theoretic models is by specifying a set of feasible strategies for that player. In dynamic game models with finite automata and bounded recall strategies, for example, feasibility of strategies is determined via certain complexity measures: the number of states of automata and the length of recall. Typically in these models, a fixed f...

متن کامل

Not Just an Empty Threat: Subgame-Perfect Equilibrium in Repeated Games Played by Computationally Bounded Players

We study the problem of finding a subgame-perfect equilibrium in repeated games. In earlier work [Halpern, Pass and Seeman 2014], we showed how to efficiently find an (approximate) Nash equilibrium if assuming that players are computationally bounded (and making standard cryptographic hardness assumptions); in contrast, as demonstrated in the work of Borgs et al. [2010], unless we restrict to c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2000